Lapped transform via time-domain pre- and post-filtering

This paper presents a general framework of constructing a large family of lapped transforms with symmetric basis functions by adding simple time-domain reand postprocessing modules onto existing block DCT based infrastructures. A subset of the resulting solutions is closed-form, fast computable, modular, near optimal in the energy compaction sense, and leads to an elegant boundary handling of finite-length data. Starting from these solutions, a general framework for block-based signal decomposition with a high degree of flexibility and adaptivity is developed. Several simplified models are also introduced to approximate the optimal solutions. These models are based on cascades of plane rotation operators and lifting steps, respectively. Despite tremendous savings in computational complexity, the optimized results of these simplified models are virtually identical to that of the complete solution. The multiplierless versions of these preand post-filters when combined with an appropriate multiplierless block transform such as the binDCT [1] generate a family of VLSI-friendly fast lapped transforms with reversible integer-to-integer mapping. Numerous design examples with arbitrary number of channels and arbitrary number of borrowed samples are presented.